Anonymity in Continuous-time Systems
نویسندگان
چکیده
Anonymous communication is a rapidly evolving area: it is needed for several privacy related services, such as anonymous electronic voting, payment or consultancy. Numerous techniques have been developed for the main goal: to deliver messages from senders to recipients in a manner that an adversary should find it difficult to identify who communicates with whom. In this paper we analyze two representatives of a relatively new field of the continuous-time anonymity systems: the SG-Mix [1] and the PROB-channel [2]. We will compare them based on simulations and come to an interesting result: although the SG-Mix was proven to be optimal1 in [3], our numbers show that the PROB-channel outperforms it in the evaluated scenarios.
منابع مشابه
On the Effectiveness of Continuous-Time Mixes under Flow Correlation Attacks
ABSTRACT To achieve anonymity in open environments such as the Internet, special proxies, denoted as mixes, were proposed to relay messages for senders and receivers. A mix may delay, batch and reorder packets to disrupt the packet-level timing correlation of packets into and out of the mix. Often multiple mixes are grouped into a mix network, which preserves anonymity in presence of compromise...
متن کاملStable Rough Extreme Learning Machines for the Identification of Uncertain Continuous-Time Nonlinear Systems
Rough extreme learning machines (RELMs) are rough-neural networks with one hidden layer where the parameters between the inputs and hidden neurons are arbitrarily chosen and never updated. In this paper, we propose RELMs with a stable online learning algorithm for the identification of continuous-time nonlinear systems in the presence of noises and uncertainties, and we prove the global ...
متن کاملLow Latency Anonymity with Mix Rings
We introduce mix rings, a novel peer-to-peer mixnet architecture for anonymity that yields low-latency networking compared to existing mixnet architectures. A mix ring is a cycle of continuous-time mixes that uses carefully coordinated cover traffic and a simple fan-out mechanism to protect the initiator from timing analysis attacks. Key features of the mix ring architecture include decoupling ...
متن کاملEnlarging Domain of Attraction for a Special Class of Continuous-time Quadratic Lyapunov Function Piecewise Affine Systems based on Discontinuous Piecewise
This paper presents a new approach to estimate and to enlarge the domain of attraction for a planar continuous-time piecewise affine system. Various continuous Lyapunov functions have been proposed to estimate and to enlarge the system’s domain of attraction. In the proposed method with a new vision and with the aids of a discontinuous piecewise quadratic Lyapunov function, the domain of attrac...
متن کاملThe Chances of Successful Attacks against Continuous-time Mixes
Continuous-time mixes represent a relatively new field in anonymity services. Their simplicity and probabilistic approach suggest promising results. In this paper their two most recent representatives, the SG Mix and the PROB Channel will be analysed. The aim of this paper is twofold: first it will be shown via analytical means that considering a locally back-tracing observer and the source-hid...
متن کامل